Theoretical analysis of persistent fault attack
نویسندگان
چکیده
منابع مشابه
Analysis of the Fault Attack ECDLP over Prime Field
In 2000, Biehl et al. proposed a fault-based attack on elliptic curve cryptography. In this paper, we refined the fault attack method. An elliptic curve E is defined over prime field Fp with base point P ∈ E Fp . Applying the fault attack on these curves, the discrete logarithm on the curve can be computed in subexponential time of Lp 1/2, 1 o 1 . The runtime bound relies on heuristics conjectu...
متن کاملA Comparative Cost/Security Analysis of Fault Attack Countermeasures
Deliberate injection of faults into cryptographic devices is an effective cryptanalysis technique against symmetric and asymmetric encryption algorithms. To protect cryptographic implementations (e.g. of the recent AES which will be our running example) against these attacks, a number of innovative countermeasures have been proposed, usually based on the use of space and time redundancies (e.g....
متن کاملTheoretical analysis of a correlation attack based on convolutional codes
One general class of attacks on stream ciphers is correlation attacks. Most of previous results regarding performance of correlation attacks have been based entirely on simulations. In this paper, we use random coding bounds for convolutional codes to give a theoretical analysis of a previously proposed correlation attack based on convolutional codes. The results from the theoretical derivation...
متن کاملFault analysis and weak key-IV attack on Sprout
Armknecht and Mikhalev proposed a new stream cipher ‘Sprout’ based on the design specification of the stream cipher, Grain-128a. Sprout has shorter state size than Grain family with a round key function. The output of the round key function is XOR’ed with the feedback bit of the NFSR of the cipher. In this paper, we propose a new fault attack on Sprout by injecting a single bit fault after the ...
متن کاملSeifert's RSA Fault Attack: Simplified Analysis and Generalizations
Seifert recently described a new fault attack against an implementation of RSA signature verification. Here we give a simplified analysis of Seifert’s attack and gauge its practicality against RSA moduli of practical sizes. We suggest an improvement to Seifert’s attack which has the following consequences: if an adversary is able to cause random faults in only 4 bits of a 1024-bit RSA modulus s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2020
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-018-9818-y